k-Sets and rectilinear crossings in complete uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We then consider the problem of constructing such decompositions for complete uniform hypergraphs, and describe its relationship with other topics, such as design theory.
متن کاملC-Perfect K-Uniform Hypergraphs
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer k,p and q, 2q ≤ p we construct a k-uniform hypergraph H with small clique number whose circular chromatic number equals p q . We define the concept and study the properties of c-perfect k-uniform hypergraphs .
متن کاملPacking k-partite k-uniform hypergraphs
Let G and H be k-graphs (k-uniform hypergraphs); then a perfect H-packing in G is a collection of vertex-disjoint copies of H in G which together cover every vertex ofG. For any fixed k-graphH let δ(H,n) be the minimum δ such that any k-graphG on n vertices with minimum codegree δ(G) ≥ δ contains a perfect H-packing. The problem of determining δ(H,n) has been widely studied for graphs (i.e. 2-g...
متن کاملApproximating Maximum Independent Sets in Uniform Hypergraphs
We consider the problem of approximating the independence number and the chromatic number of k-uniform hypergraphs on n vertices. For xed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log 1) n)2). This extends results of Boppana and Halld orsson [5] who showed for the graph case that an approximation ratio of O(n=(logn)) c...
متن کاملUniform Coloured Hypergraphs and Blocking Sets
In this paper some properties of k-chromatic and strong k-chromatic hypergraphs are proved. Conditions for the possible existence of blocking sets in Steiner systems are established. Mathematics Subject Classification: 05C15; 05B05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2020
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2019.101578